Exterior derivatives and Laplacians on digraphs
نویسنده
چکیده
Given a digraph G = (V,E) with the set of vertices V and the set of edges E, let d : F → Ω be the exterior derivative map from the space of complex-valued functions on V to the complex vector space spanned by E. We introduce the Laplacian ∆ : F → F and the label difference map d̂ : F → (Ω1)∗ of F into the dual space (Ω1)∗ of Ω and establish their connections with d. In particular, we prove that, given elements φ and ψ of F, the image of the conjugate dψ of dψ under d̂φ is equal to the value of the Hermitian product between ∆φ and ψ and that d̂φ is a flow in G associated to ∆φ.
منابع مشابه
Hodge Laplacians on graphs
This is an elementary introduction to the Hodge Laplacian on a graph, a higher-order generalization of the graph Laplacian. We will discuss basic properties including cohomology and Hodge theory. At the end we will also discuss the nonlinear Laplacian on a graph, a nonlinear generalization of the graph Laplacian as its name implies. These generalized Laplacians will be constructed out of coboun...
متن کاملMore skew-equienergetic digraphs
Two digraphs of same order are said to be skew-equienergetic if their skew energies are equal. One of the open problems proposed by Li and Lian was to construct non-cospectral skew-equienergetic digraphs on n vertices. Recently this problem was solved by Ramane et al. In this paper, we give some new methods to construct new skew-equienergetic digraphs.
متن کاملDeterminants of Laplacians in Exterior Domains
We consider classes of simply connected planar domains which are isophasal, ie, have the same scattering phase s(λ) for all λ > 0. This is a scattering-theoretic analogue of isospectral domains. Using the heat invariants and the determinant of the Laplacian, Osgood, Phillips and Sarnak showed that each isospectral class is sequentially compact in a natural C∞ topology. This followed earlier wor...
متن کاملCs 468 Notes: Differential Geometry for Computer Science
1. Overview: 4/1/13 1 2. Curves: 4/3/13 3 3. Discrete Curves: 4/8/13 5 4. The Definition of a Surface: 4/10/13 8 5. Surface Geometry: 4/15/13 9 6. Discrete Surfaces: 4/17/13 11 7. Extrinsic Curvature: 4/22/13 13 8. Computing Curvature: 4/24/13 14 9. Intrinsic Geometry: The Induced Metric and Geodesics : 4/29/13 17 10. 5/1/13 19 11. Covariant Differentiation: 5/6/13 19 12. Discrete Laplacians: 5...
متن کاملSufficient conditions on the zeroth-order general Randic index for maximally edge-connected digraphs
Let D be a digraph with vertex set V(D) .For vertex v V(D), the degree of v, denoted by d(v), is defined as the minimum value if its out-degree and its in-degree . Now let D be a digraph with minimum degree and edge-connectivity If is real number, then the zeroth-order general Randic index is defined by . A digraph is maximally edge-connected if . In this paper we present sufficient condi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 29 شماره
صفحات -
تاریخ انتشار 2004